Numerical Verification of Industrial Numerical Codes
نویسندگان
چکیده
منابع مشابه
Numerical Verification of Industrial Numerical Codes
Several approximations occur during a numerical simulation: physical effects mapy be discarded, continuous functions replaced by discretized ones and real numbers replaced by finite-precision representations. The use of the floating point arithmetic generates round-off errors at each arithmetical expression and some mathematical properties are lost. The aim of the numerical verification activit...
متن کاملNumerical Semigroups and Codes
Anumerical semigroup is a subset ofN containing 0, closed under addition and with finite complement in N. An important example of numerical semigroup is given by the Weierstrass semigroup at one point of a curve. In the theory of algebraic geometry codes, Weierstrass semigroups are crucial for defining bounds on the minimum distance as well as for defining improvements on the dimension of codes...
متن کاملProgram Verification of Numerical Computation
These notes outline a formal method for program verification of numerical computation. It forms the basis of the software package VPC in its initial phase of development. Much of the style of presentation is in the form of notes that outline the definitions and rules upon which VPC is based. The initial motivation of this project was to address some practical issues of computation, especially o...
متن کاملBlock Prefetching for Numerical Codes
Cache optimization is a crucial technique for most numerical code to exploit the performance of modern processors. It can be classified into improving access locality, and prefetching. Inherent algorithm constrains often limit the first approach which typically uses a blocking technique. While there exist automatic prefetching mechanism in hardware and/or compilers, they can not complement bloc...
متن کاملCtadel: A Generator of Efficient Numerical Codes Ctadel: A Generator of Efficient Numerical Codes
Algorithm Templates. According to Kant and Steinberg [82], linear solvers and related algorithms can be cast in the form of so-called algorithm templates. Templates are algebraic structures that capture the essentials of an algorithm, elaborated with problem-specific aspects, and can be transformed into a chosen target language. The SciNapse system [2] uses algorithm templates in the automatic ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ESAIM: Proceedings
سال: 2012
ISSN: 1270-900X
DOI: 10.1051/proc/201235006